Remembering Chandra Kintala
نویسندگان
چکیده
With this contribution we would like to remember Chandra M. R. Kintala who passed away in November 2009. We will give short overviews of his CV and his contributions to the field of theoretical and applied computer science and, given the opportunity, will attempt to present the current state of limited nondeterminism and limited resources for machines. Finally, we will briefly touch on some research topics which hopefully will be addressed in the not so distant future.
منابع مشابه
Descriptional Complexity of Machines with Limited Resources
Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of different contexts, our goal here is to provide a survey of these results. Particular emphasis is put on limiting resources (e.g., nondeterminism, ambiguity, lookahead, etc.) for various types of finite state machines, push...
متن کاملFormal Limits on Determining Reliabilities of Component-Based Software Systems
We present a model for analyzing the reliability of component-based software systems. Each software component is described as a nite state machine whose transitions have failure probabilities that re ect the unreliable execution of elementary component operations. Alternatively, we model a component as a nite state machine with an associated reliability gure that expresses the overall reliabili...
متن کاملCheckpointing and Its Applications
This paper describes our experience with the implementation and applications of the Unix checkpointing library libckp, and identifies two concepts that have proven to be the key to making checkpointing a powerful tool. First, including all persistent state, i.e., user files, as part of the process state that can be checkpointed and recovered provides a truly transparent and consistent rollback....
متن کاملTradeoffs Between Reliability and Conciseness of Deterministic Finite Automata
In this paper, we propose a model for measuring the reliability of the description of a language by a deterministic finite automaton . Intuitively, the reliability exhibits when used for is high if the “difference” between and the language accepted by is small. Using this model, we prove that the savings in the number of states between a fully reliable and a less reliable representation cannot ...
متن کاملONE-IP: Techniques for Hosting a Service on a Cluster of Machines
With the explosive growth of the World Wide Web, some popular Web sites are getting thousands of hits per second. As a result, clients (browsers) experience slow response times and sometimes may not be able to access some Web sites at all. Upgrading the server nodes to more powerful machines may not always be cost-effective. A natural solution is to deploy a set of machines, or a cluster, and h...
متن کامل